// -*- coding: utf-8 -*- 
/**
 * Project: AlgorithmsLearn
 * Creator: yanking
 * Create time: 2022-02-27 15:32
 * IDE: IntelliJ IDEA
 * Introduction:
 */
package com.LeetCodeT.Greedy;

import org.junit.jupiter.api.Test;

public class Run {
    @Test
    public void shout00() {
        //int[] prices = {7, 1, 5, 3, 6, 4};
        //int[] prices = {1, 2, 3, 4, 5};
        //int[] prices = {0, 1, 2, 3, 4, 5};
        int[] prices = {1, 9, 6, 9, 1, 7, 1, 1, 5, 9, 9, 9};
        System.out.println(new MaxProfit().maxProfit(prices));
    }

    @Test
    public void shout01() {
//        int[] gas = {1, 2, 3, 4, 5};
//        int[] cost = {3, 4, 5, 1, 2};
        int[] gas = {5, 1, 2, 3, 4};
        int[] cost = {4, 4, 1, 5, 1};
        System.out.println(new CanCompleteCircuit().canCompleteCircuit(gas, cost));
    }

    @Test
    public void shout02() {
        // int[] nums = {10, 2};
        int[] nums = {3, 30, 34, 5, 9};
        System.out.println(new LargestNumber().largestNumber(nums));
    }
}
